The reconstruction of maximal planar graphs. I. Recognition
نویسندگان
چکیده
منابع مشابه
The reconstruction of maximal planar graphs II. Reconstruction
We assume that the reader is familiar with the work [ 1 ] and with the notation and results of the first paper [3 1. Further terminology used in this paper will be defined as it appears. In the first paper the recognition of maximal planar graphs was established. We now prove further that this class of graphs is indeed reconstructible. We first recall that the following result was proved by Fio...
متن کاملSpanning Maximal Planar Subgraphs of Random Graphs
We study the threshold for the existence of a spanning maximal planar subgraph in the random graph Gn . We show that it is very near p = ~TTOWe also discuss the threshold for the existence of a spanning maximal outerplanar subgraph. This is very near
متن کاملOn properties of maximal 1-planar graphs
A graph is called 1-planar if there exists a drawing in the plane so that each edge contains at most one crossing. We study maximal 1-planar graphs from the point of view of properties of their diagrams, local structure and hamiltonicity.
متن کاملOn the reconstruction of planar graphs
We show that the planarity of a graph can be recognized from its vertex deleted subgraphs, which answers a question posed by Bondy and Hemminger in 1979. We also state some useful counting lemmas and use them to reconstruct certain planar graphs. AMS subject classification: Primary 05C60, Secondary 05C10, 05C40, 05C38
متن کاملPower domination in maximal planar graphs
Power domination in graphs emerged from the problem of monitoring an electrical system by placing as few measurement devices in the system as possible. It corresponds to a variant of domination that includes the possibility of propagation. For measurement devices placed on a set S of vertices of a graph G, the set of monitored vertices is initially the set S together with all its neighbors. The...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1981
ISSN: 0095-8956
DOI: 10.1016/0095-8956(81)90063-0